Simple Multivariate Polynomial Multiplication
نویسندگان
چکیده
منابع مشابه
Iterative Karatsuba For Multivariate Polynomial Multiplication
This work deals with Karatsuba method for multivariate polynomials, not recursing on variables number, but using an iterative scheme, with an eye to a better parallelism exploitation. Integers base 2 and 3 expansions are used in order to access the needed data. AMS Subject Classification: 11A05, 11A25, 11K65, 11Y70
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملBivariate Polynomial Multiplication
Inspired by the discussion in [5], we study the multiplicative complexity and the rank of the multiplication in the local algebras Rm;n = k[x; y]=(xm+1; yn+1) and Tn = k[x; y]=(xn+1; xny; : : : ; yn+1) of bivariate polynomials. We obtain the lower bounds (2 13 o(1)) dimRm;n and (2 12 o(1)) dim Tn for the multiplicative complexity of the multiplication in Rm;n and Tn, respectively. On the other ...
متن کاملAdaptive Polynomial Multiplication
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement in many “easy” cases where other algorithms are doing too much work. Three ideas for adaptive polynomial multiplication are given. One method, which we call...
متن کاملCode Generation for Polynomial Multiplication
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and short products for this family of algorithms and describe code generation techniques that result in highperformance implementations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1042